package Leetcode.lc035;

public class Sloution {
    public int searchInsert(int[] nums, int target) {
      int left=0,right=nums.length-1;
      while(left<=right){
          int mid=left+(right-left)/2;
          if(nums[mid]==target){
              return mid;
          } else if (nums[mid]<target) {
              left=mid+1;
          }else{
              right=mid-1;
          }
      }
      return left;
    }

    public static void main(String[] args) {
        Sloution sloution = new Sloution();
        int[] ints = {1, 2, 3, 5, 6};
        int target=4;
        int i = sloution.searchInsert(ints, target);
        System.out.print(i);
    }
}
